Item Relational Structure Algorithm Based on Empirical Distribution Critical Value

Takeya’s item relational structure theory is a well-known ordering algorithm. However, its threshold limit value is a fixed value, lacking of statistical meaning, In this paper, the authors provide an improved threshold limit value by using the empirical distribution critical value of all the values of the relational structure indices between any two items, it is more sensitive and effective than the traditional fixed threshold for comparing the ordering relation of any two items. A computer program is developed for the proposed method. A Mathematics example is also provided in this paper to illustrate the advantages of the proposed methods.